Population-based Extremal Optimization Algorithm for Hot Rolling Scheduling Problem
نویسندگان
چکیده
The paper presents a valid model and a solution method named population-based extremal optimization algorithm (PEOA) to solve the hot rolling scheduling problem (HRSP). Firstly, the problem is formulated as a prize-collecting vehicle problem (PCVRP), which considers two major requirements: (a) selecting a subset of slabs from manufacturing slabs to be processed; (b) determining the optimal production sequence under multiple constraints, such as sequence-dependant transition costs, non-execution penalties etc. Secondly, a new algorithm which combined the extremal optimization (EO) with population evolutionary technique is proposed to solve the problem. The proposed algorithm is applied to a set of real production data and the performance of the algorithm is evaluated by comparing the results with other algorithms such as EO, modified algorithm (MGA), etc. Comparing results indicate that this new algorithm is an effective and competitive approach for the HRSP.
منابع مشابه
A Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory
We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملOptimizing production scheduling of steel plate hot rolling for economic load dispatch under time-of-use electricity pricing
Time-of-Use (TOU) electricity pricing provides an opportunity for industrial users to cut electricity costs. Although many methods for Economic Load Dispatch (ELD) under TOU pricing in continuous industrial processing have been proposed, there are still difficulties in batch-type processing since power load units are not directly adjustable and nonlinearly depend on production planning and sche...
متن کاملAn Application of Lagrangean Decomposition to the Scheduling of Hot Charged Rolling in Steel Production
-In this paper a Lagrangean decomposition technique for solving the scheduling problem for Hot Charged Rolling (HCR) in the continuous casting process which involves sequencing and grouping. This Lagrangian relaxation algorithm is proposed that incorporate two sets of constraints into the objective function after applying the variable splitting technique. The relaxed problem has a special struc...
متن کامل